Is Occam's Razor Disposable?
نویسندگان
چکیده
منابع مشابه
Ockham's razor is not so sharp
A 39-year-old male with newly diagnosed HIV had cavitary pneumonia initially attributed to Pneumocystis jirovecii but actually caused by Rhodococcus equi. After neurological deterioration, he was found to have intracerebral lesions caused by Toxoplasma gondii. This case underscores the inability to rely on the search for a unifying diagnosis (Ockham's Razor) in HIV-infected patients.
متن کاملOccam's Razor
The Bayesian paradigm apparently only sometimes gives rise to Occam’s Razor; at other times very large models perform well. We give simple examples of both kinds of behaviour. The two views are reconciled when measuring complexity of functions, rather than of the machinery used to implement them. We analyze the complexity of functions for some linear in the parameter models that are equivalent ...
متن کاملHow Sharp is Occam's Razor? Language Statistics in Cognitive Processing
According to the dominant view in cognitive science, language processing requires perceptual simulation of symbols. Various experiments have shown that words that share a perceptual relationship are processed faster. We have proposed an alternative view in which perceptual cues are encoded in language. However, experiments supporting perceptual simulation or language statistics have focused on ...
متن کاملSharpening Occam's Razor
We provide a new representation-independent formulation of Occam’s razor theorem, based on Kolmogorov complexity. This new formulation allows us to: (i) Obtain better sample complexity than both length-based [4] and VC-based [3] versions of Occam’s razor theorem, in many applications; and (ii) Achieve a sharper reverse of Occam’s razor theorem than that of [5]. Specifically, we weaken the assum...
متن کاملExtending Occam's Razor
Occam's Razor states that, all other things being equal, the simpler of two possible hypotheses is to be preferred. A quanti ed version of Occam's Razor has been proven for the PAC model of learning, giving sample-complexity bounds for learning using what Blumer et al. call an Occam algorithm [1]. We prove an analog of this result for Haussler's more general learning model, which encompasses le...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Royal Society of Medicine
سال: 1987
ISSN: 0141-0768,1758-1095
DOI: 10.1177/014107688708001130